منابع مشابه
A Simple Polygon Triangulation Algorithm
In this Paper we propose an easily implementable polygon triangulation algorithm using Shortest Paths. The algorithm runs in O(nlogk) deterministic time with k < n 3 . Our algorithm runs in linear time for a large class of polygons. The biggest advantage of the algorithm is that it uses very simple data structures and it computes the triangulation just by scanning the boundary of the polygon. W...
متن کاملWatchman route in a simple polygon with a rubberband algorithm
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n log n), published in 2003 by M. Dror, A. Efrat, A. Lubiw, and J. Mitchell. – This paper provides an algorithm with κ(ε) · O(kn) runtime, where n is the number of vertices of the given simple polygon Π, and k the number...
متن کاملA simple kinetic visibility polygon
! " # %$& (') * + , -. ('0/ '1 2 3 %$4 52 /6 3 % & 4 7 89 & : ;< %$& = : > >;2'1 ; ? @ A CB*'1 = = : ;D E< -+'1 4 GFIH J K & = :5L /< = %$9 = 3 %$ M = 4 ON ,P 052 = ') ; M!'1 ; ? 0 Q ? = ? ! F Categories and Subject Descriptors R S TLS TJU V WYX1Z&[K\9Z0]_^_Z)`#acbed f4d g%Z)hji kmlmn0oKp*q1rOs*r(tKuvl p*w tKx=s*y=z4{3r oKn0|9}~x=t &p* { t {34p* 1s*yGqL 0M: & 3 / : = ? / %$ J 05
متن کاملAn Algorithm for Computing Constrained Reflection Paths in Simple Polygon
Let s be a source point and t be a destination point inside an n-vertex simple polygon P . Euclidean shortest paths [Lee and Preparata, Networks, 1984; Guibas et al. , Algorithmica, 1987] and minimum-link paths [Suri, CVGIP, 1986; Ghosh, J. Algorithms, 1991] between s and t inside P have been well studied. Both these kinds of paths are simple and piecewise-convex. However, computing optimal pat...
متن کاملCovering a Simple Polygon by Monotone Directions
In this paper we study the problem of finding a set of k directions for a given simple polygon P , such that for each point p ∈ P there is at least one direction in which the line through p intersects the polygon only once. For k = 1, this is the classical problem of finding directions in which the polygon is monotone, and all such directions can be found in linear time for a simple n-gon. For ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Society of Computer and Information
سال: 2016
ISSN: 1598-849X
DOI: 10.9708/jksci.2016.21.5.041